Canonical forms for mixed symmetric–skewsymmetric quaternion matrix pencils
نویسندگان
چکیده
منابع مشابه
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
Dynamical systems, such as electric circuits, mechanical systems, and chemical plants, can be modeled by mixed matrix pencils, i.e., matrix pencils having two kinds of nonzero coefficients: fixed constants that account for conservation laws and independent parameters that represent physical characteristics. Based on dimension analysis of dynamical systems, Murota (1985) introduced a physically ...
متن کاملCanonical forms for doubly structured matrices and pencils
In this paper we derive canonical forms under structure preserving equivalence transformations for matrices and matrix pencils that have a multiple structure, which is either an H-selfadjoint or H-skew-adjoint structure, where the matrix H is a complex nonsingular Hermitian or skew-Hermitian matrix. Matrices and pencils of such multiple structures arise for example in quantum chemistry in Hartr...
متن کاملReduction and Normal Forms of Matrix Pencils
Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation Ex′ + Ax = 0. Such an equation is invariant by changes of variables, or linear combination of the equations. This change of variables or equations is associated to a group action. The invariants corresponding to this group action...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS On Kronecker Canonical Form of Mixed Matrix Pencils
A mixed matrix pencil is a matrix pencil which has two kinds of nonzero coefficients: fixed constants that account for conservation laws and independent parameters that represent physical characteristics. In this paper, we characterize the indices of nilpotency of the Kronecker canonical form for a mixed matrix pencil in terms of matroids. As a byproduct, we provide an algorithm for computing t...
متن کاملNearly Optimal Algorithms for Canonical Matrix Forms
A Las Vegas type probabilistic algorithm is presented for nding the Frobenius canonical form of an n n matrix T over any eld K. The algorithm requires O~(MM(n)) = MM(n) (logn) O(1) operations in K, where O(MM(n)) operations in K are suucient to multiply two n n matrices over K. This nearly matches the lower bound of (MM(n)) operations in K for this problem, and improves on the O(n 4) operations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2007
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.10.016